Zero-knowledge convincing protocol on quantum bit is impossible
نویسندگان
چکیده
منابع مشابه
(Nonrelativistic) Quantum Bit Commitment Really Is Impossible
Unconditionally secure (nonrelativistic) quantum bit commitment has been shown to be impossible by Mayers [23] and Lo and Chau [19, 20], but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an ‘Einstein-Podolsky-Rosen’ attack or cheating strategy can always be applied, is clarified. The question of whether following such a ch...
متن کاملUnconditionally secure quantum bit commitment is impossible
The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this r...
متن کاملUnconditionally Secure Quantum Bit Commitment Really Is Impossible
Unconditionally secure quantum bit commitment has been shown to be impossible by Mayers [22] and Lo and Chau [18, 19], but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an ”Einstein-PodolskyRosen’ attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can...
متن کاملWhy quantum bit commitment and quantum coin tossing are impossible ? ∗
There had been well known claims of “provably unbreakable” quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wonder if se...
متن کاملConstant-Round Perfect Zero-Knowledge Computationally Convincing Protocols
A perfect zero-knowledge interactive protocol allows a prover to convince a veri er of the validity of a statement in a way that does not give the veri er any additional information [GMR,GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verier. An important measure of e ciency for these protocols is the number of rounds in the interaction. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2017
ISSN: 2521-327X
DOI: 10.22331/q-2017-12-23-41